Triangulations with Very Few Geometric Bistellar Neighbors
نویسنده
چکیده
We are interested in a notion of elementary change between triangulations of a point connguration, the so-called bistellar ips, introduced by Gel'fand, Kapranov and Zelevinski. We construct sequences of triangulations of point conngurations in dimension 3 with n 2 +2n+2 vertices and only 4n?3 geometric bistellar ips (for every even integer n), and of point conngurations in dimension 4 with arbitrarily many vertices and a bounded number of ips. This drastically improves previous examples and seems to be evidence against the conjecture that any two triangulations of a point connguration can be joined by a sequence of ips.
منابع مشابه
The Number of Geometric Bistellar Neighbors of a Triangulation
The theory of secondary and ber polytopes implies that regular (also called convex or coherent) triangulations of conngurations with n points in R d have at least n?d?1 geometric bistellar neighbors. Here we prove that, in fact, all triangulations of n points in R 2 have at least n ? 3 geometric bistellar neighbors. In a similar way, we show that for three dimensional point conngurations, in co...
متن کاملJa n 20 06 Geometric bistellar flips . The setting , the context and a construction
We give a self-contained introduction to the theory of secondary polytopes and geometric bistellar flips in triangulations of polytopes and point sets, as well as a review of some of the known results and connections to algebraic geometry, topological combinatorics, and other areas. As a new result, we announce the construction of a point set in general position with a disconnected space of tri...
متن کاملGeometric bistellar flips: the setting, the context and a construction
We give a self-contained introduction to the theory of secondary polytopes and geometric bistellar flips in triangulations of polytopes and point sets, as well as a review of some of the known results and connections to algebraic geometry, topological combinatorics, and other areas. As a new result, we announce the construction of a point set in general position with a disconnected space of tri...
متن کاملEnumerating Triangulations of Convex Polytopes
A triangulation of a finite point set A in IRd is a geometric simplicial complex which covers the convex hull of A and whose vertices are points of A. We study the graph of triangulations whose vertices represent the triangulations and whose edges represent geometric bistellar flips. The main result of this paper is that the graph of triangulations in three dimensions is connected when the poin...
متن کاملThe Graph of Triangulations of a Point Configuration with d +4 Vertices Is 3-Connected
We study the graph of bistellar ips between triangulations of a vector connguration A with d + 4 elements in rank d + 1 (i.e. with corank 3), as a step in the Baues problem. We prove that the graph is connected in general and 3-connected for acyclic vector conngurations, which include all point conngurations of dimension d with d + 4 elements. Hence, every pair of triangulations can be joined b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 23 شماره
صفحات -
تاریخ انتشار 2000